Private Collection Matching Protocols

We introduce Private Collection Matching (PCM) problems, in which a client aims to determine whether collection of sets owned by server matches their interests. Existing privacy-preserving cryptographic primitives cannot solve PCM problems efficiently without harming privacy. propose modular framework that enables designers build systems output one bit: the client's set. The communication cost our protocols scales linearly with size set and is independent number elements. demonstrate potential designing implementing novel solutions for two real-world problems: determining dataset has chemical compounds interest, document relevant documents. Our evaluation shows we offer privacy gain respect existing works at reasonable computation cost.